Comparison of Fair Queuing Algorithms with a Stochastic Approach
نویسندگان
چکیده
In this paper we compare fair queueing algorithms with a novel approach based on the majorization theory of real valued vectors. We study the temporal evolution of the received normalized service of all backlogged sessions. In this way, we try to give a better insight into the performance of a Fair Queueing policy than what worst-case measures can provide. As an application of this approach, we study in this paper the eeect of the eligibility criterion on the service discrepancy. We show that a FQ policy with a large eligibility set scatters the normalized service less than another FQ policy with a smaller eligible set.
منابع مشابه
Designing Stochastic Cell Formation Problem Using Queuing Theory
This paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. In this research, cells are defined as a queue system which will be optimized via queuing theory. In this queue system, each machine is assumed as a server and each part as a customer. The grouping of machines and parts...
متن کاملEligible Start-time Fair Queuing: a New Fair Queuing Policy and Its Analysis with a Stochastic Comparison Approach
We present a new Fair Queuing policy adapted to low-bandwidth ows, and preventing discrepancy which is encountered under almost all of the existing Fair Queuing policies. Unlike Packet-by-packet Generalized Processor Sharing PGPS and its version Worst-case Fair, Fair Queuing WF 2 Q which eliminates discrepancy, the proposed scheduling algorithm is computationally eecient hence feasible for high...
متن کاملComparison of Queuing Algorithms against DDoS Attack
In this paper, we are going to present the simulation results of comparison of five queuing algorithms (Drop Tail, Fair Queuing, Stochastic Fair Queuing, Deficit Round Robin and Random Early Detection) using ns-2 as simulation environment. Comparison of the queuing algorithms is based on attack-intensity. We are checking the performance of each queuing algorithm on a particular queue limit agai...
متن کاملQueuing Algorithms Performance against Buffer Size and Attack Intensities in DDOS Attacks
Distributed Denial of Service (DDoS) attack is one of the biggest threats now days. This paper aims at providing the simulation results of buffer size and attack intensities effect on various queuing algorithms such as DropTail, Fair Queuing (FQ), Stochastic Fair Queuing (SFQ), Deficit Round Robin (DRR) and Random Early Detection (RED) using ns-2 as a simulation environment. The results in this...
متن کاملA stochastic model for the cell formation problem considering machine reliability
This paper presents a new mathematical model to solve cell formation problem in cellular manufacturing systems, where inter-arrival time, processing time, and machine breakdown time are probabilistic. The objective function maximizes the number of operations of each part with more arrival rate within one cell. Because a queue behind each machine; queuing theory is used to formulate the model. T...
متن کامل